Marginal Checking of a Markovian Degradation Unit When Checking Interval Is Probabilistic
نویسنده
چکیده
Marginal checking of a Markovian degradation unit is treated when time interval to the next checking is not fixed but obeys a certain general distribution. The problem of determing the optimal set of the states at which the unit is replaced with a new one (marginal set) is discussed. It is solved by using Markov-renewal programming with modified policy iteration cycle. It is showed that control limit rule holds for the optimal policy. The expected cost associated with preventive maintenance and corrective maintenance when the unit is operated in an infinite time span (cost rate) is derived. The unimodality of the cost rate with respect to the control limit is discussed, and a necessary and sufficient condition for preventive replacement to be effective is given.
منابع مشابه
Towards Feasible Approach to Plan Checking under Probabilistic Uncertainty: Interval Methods
The main problem of planning is to find a sequence of actions that an agent must perform to achieve a given objective. An important part of planning is checking whether a given plan achieves the desired objective. Historically, in AI, the planning and plan checking problems were mainly formulated and solved in a deterministic environment, when the initial state is known precisely and when the r...
متن کاملModel Checking Concurrent Programs with Nondeterminism and Randomization under Alternate Semantics
For concurrent probabilistic programs having process-level nondeterminism, it is often necessary to restrict the class of schedulers that resolve nondeterminism to obtain sound and precise model checking algorithms. In this paper, we introduce two classes of schedulers called view consistent and locally Markovian schedulers and consider the model checking problem of concurrent, probabilistic pr...
متن کاملModel Checking Concurrent Programs with Nondeterminism and Randomization
For concurrent probabilistic programs having process-level nondeterminism, it is often necessary to restrict the class of schedulers that resolve nondeterminism to obtain sound and precise model checking algorithms. In this paper, we introduce two classes of schedulers called view consistent and locally Markovian schedulers and consider the model checking problem of concurrent, probabilistic pr...
متن کاملRecent Advances in Importance Sampling for Statistical Model Checking
Probabilistic model checking is an increasingly popular technique for the analysis of the performance of highly reliable systems. Using probabilistic model checking, one exhaustively analyses the behaviour of a system until a statement can be made about the probability that, or the time until some interesting event occurs in the system. If the state space of the model is very large, which is of...
متن کاملTimed Automata Approach to Verification of Systems with Degradation
We focus on systems that naturally incorporate a degrading quality, such as electronic devices with degrading electric charge or broadcasting networks with decreasing power or quality of a transmitted signal. For such systems, we introduce an extension of linear temporal logic with quantitative constraints (Linear Temporal Logic with Degradation Constraints, or DLTL for short) that provides a u...
متن کامل